OpenThinning: Fast 3D Thinning based on Local Neighborhood Lookups

نویسندگان

  • Tobias Post
  • Christina Gillmann
  • Thomas Wischgoll
  • Hans Hagen
چکیده

3D Thinning is an often required image processing task in order to perform shape analysis in various applications. For researchers in these domains, a fast, flexible and easy to access implementation is required. Open source solutions, as the Insights Segmentation and Registration Toolkit (ITK), are often used for image processing and visualization tasks, due to their wide range of provided algorithms. Unfortunately, ITK’s thinning implementation is computational expensive and allows solely one specific thinning approach. Therefore, this work presents OpenThinning, an open source thinning solution for 3D image data. The implemented algorithm evaluates a moving local neighborhood to find deletable voxels, according to different sets of criteria. In order to reduce the computational effort, all possible local neighborhood setting outputs are stored in a lookup table. To show the effectiveness of OpenThinning, the implementation is compared to the performance of the ITK library.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast 3D Thinning of Medical Image Data based on Local Neighborhood Lookups

Three-dimensional thinning is an important task in medical image processing when performing quantitative analysis on structures, such as bones and vessels. For researchers of this domain a fast, robust and easy to access implementation is required. The Insight Segmentation and Registration Toolkit (ITK) is often used in medical image processing and visualization as it offers a wide range of rea...

متن کامل

An Algorithm for a 3D Simplicity Test

According to Kong [4], a thinning algorithm T is connectivity preserving if and only if every set deleted by T can Every thinning (or shrinking) algorithm can be stated as a list of deletion configurations. If a neighborhood of a given be ordered in such a sequence that every point is simple image point matches one of these configurations, the point will after all previous points in the sequenc...

متن کامل

A 3D 12-subiteration thinning algorithm based on P-simple points

In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A′, such that A′ ...

متن کامل

Automatic Generation of 3D Networks in CityGML via MUSCLE Model

This paper describes the usage of MUSCLE (Multidirectional Scanning for Line Extraction) Model for automatic generation of 3D networks in CityGML format (from raster floor plans). The algorithm of the model implements line thinning and simple neighborhood methods for vectorization. The model allows user to define specific criteria which are crucial for acquiring the vectorization process. The n...

متن کامل

A Fast and Fully Automatic Ear Recognition Approach Based on 3D Local Surface Features

Sensitivity of global features to pose, illumination and scale variations encouraged researchers to use local features for object representation and recognition. Availability of 3D scanners also made the use of 3D data (which is less affected by such variations compared to its 2D counterpart) very popular in computer vision applications. In this paper, an approach is proposed for human ear reco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016